package topic.dp;
//746 最小花费爬楼梯
public class MinCostClimbingStairs {
    public static void main(String[] args) {
        /*
        [10,15,20]
         */
        int[] arr={10,15,20};
        System.out.println(method(arr));

    }

    public static int method(int[] cost){
        int len = cost.length;
        int[] dp=new int[len+1];
        dp[0]=0;
        dp[1]=0;
        for (int i = 2; i <= len; i++) {
            dp[i]= Math.min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);//第一步支付费用
        }
        return dp[len];
    }
}
